Distance Matrices and n-dimensional Designs
نویسندگان
چکیده
منابع مشابه
On the construction of n-dimensional designs from 2-dimensional designs
design, then = (f(hI + h2 + ... + hn») is a proper n-dimensional design. A difficulty with this construction that it can applied to small number of (2dimensional) designs. This paper develm)s a very general technique for generating a proper n -dimensional design from 2-dimensional designs. Indeed, it is shown that Drake's generalised Hadamard matrices, Berman's nega-cyclic and (i)-cyclic (gener...
متن کاملUsing Kullback-Leibler distance for performance evaluation of search designs
This paper considers the search problem, introduced by Srivastava cite{Sr}. This is a model discrimination problem. In the context of search linear models, discrimination ability of search designs has been studied by several researchers. Some criteria have been developed to measure this capability, however, they are restricted in a sense of being able to work for searching only one possibl...
متن کاملDistance matrices and isometric embeddings
Matrices with random (or pseudo-random) elements appear naturally in different physical problems and their statistical properties have been thoroughly investigated (see e.g. [1]). A special case of random matrices, called distance matrices, has been recently proposed in [2]. They are defined for any metric space X with a probability measure μ on it as follows. Choose N points ~xj ∈ X randomly d...
متن کاملOrthogonal designs from negacyclic matrices
We study the use of negacyclic matrices to form orthogonal designs and hence Hadamard matrices. We give results for all possible tuple for order 12, all but 3 for order 20 and all but 3 for order 28.
متن کاملOn distance matrices and Laplacians
We consider distance matrices of certain graphs and of points chosen in a rectangular grid. Formulae for the inverse and the determinant of the distance matrix of a weighted tree are obtained. Results concerning the inertia and the determinant of the distance matrix of an unweighted unicyclic graph are proved. If D is the distance matrix of a tree, then we obtain certain results for a perturbat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1981
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(81)80008-x